Randomness, Computation and Mathematics
نویسنده
چکیده
This article examines some of the recent advances in our understanding of algorithmic randomness. It also discusses connections with various areas of mathematics, computer science and other areas of science. Some questions and speculations will be discussed.
منابع مشابه
Computing on the Edge of Chaos: Structure and Randomness in Encrypted Computation
This survey, aimed mainly at mathematicians rather than practitioners, covers recent developments in homomorphic encryption (computing on encrypted data) and program obfuscation (generating encrypted but functional programs). Current schemes for encrypted computation all use essentially the same “noisy” approach: they encrypt via a noisy encoding of the message, they decrypt using an “approxima...
متن کاملParticle swarm optimization using dimension selection methods
Particle swarm optimization (PSO) has undergone many changes since its introduction in 1995. Being a stochastic algorithm, PSO and its randomness present formidable challenge for the theoretical analysis of it, and few of the existing PSO improvements have make an effort to eliminate the random coefficients in the PSO updating formula. This paper analyzes the importance of the randomness in the...
متن کاملConsistent sets of lines with no colorful incidence
We consider incidences among colored sets of lines in R and examine whether the existence of certain concurrences between lines of k colors force the existence of at least one concurrence between lines of k + 1 colors. This question is relevant for problems in 3D reconstruction in computer vision. 2012 ACM Subject Classification Theory of computation → Randomness, geometry and discrete structur...
متن کاملThe Mathematical Foundations of Randomness
Wegive anontechnical account of themathematical theoryof randomness. The theory of randomness is founded on computability theory, and it is nowadays often referred to as algorithmic randomness. It comes in two varieties: A theory of finite objects, that emerged in the 1960s through the work of Solomonoff, Kolmogorov, Chaitin and others, and a theory of infinite objects (starting with von Mises ...
متن کاملLECTURE 8: Random numbers
Randomness (uncorrelatedness) is an asymptotic property of a sequence of numbers {x1,x2, . . . ,xn} for n >> 1. Thus we cannot ask if 58935 is "more random" than 12345, since we cannot associate randomness with individual numbers. There is no unique definition of randomness, but in principle we could try to check that all cross-correlations approach zero as n→∞. But this is a hopeless task (it ...
متن کامل